Developing Combined Genetic Algorithm – Hill Climbing Optimization Method for Area Traffic Control

نویسنده

  • Halim Ceylan
چکیده

This study develops a Genetic Algorithm with TRANSYT Hill-Climbing optimization routine, referred to as GATHIC, and proposes a method for decreasing the search space, referred to as ADESS, to find optimal or near optimal signal timings for area traffic control (ATC). The ADESS with GATHIC model is an algorithm, which solves the ATC problem to optimize signal timings for all signal controlled junctions by taking into account co-ordination effects. The flowchart of the proposed model with ADESS algorithm is correspondingly given. The GATHIC is applied to a well-known road network in literature for fix sets of demand. Results showed that the GATHIC is better in signal timing optimization in terms of optimal values of timings and performance index when it is compared with TRANSYT, but it is computationally demanding due to the inclusion of the Hill-Climbing method into the model. This deficiency may be removed by introducing the ADESS algorithm. The GATHIC model is also tested for 10% increased and decreased values of demand from a base demand. 1 Assoc. Prof. Dr., Pamukkale University, address: Ins. Muh. Bol. Muh. Fak. Pamukkale University, Denizli, 20017, Turkey. E-mail: [email protected], Tel:+90-258-2134030, Fax: +90-258-2125548

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Traffic Signals on Urban Arteries through a Platoon- Based Simulation Model

The paper describes an optimization procedure to synchronize traffic signals along an urban road artery. The solution procedure applies first a genetic algorithm and then a hill climbing algorithm for local adjustments. The fitness function is evaluated by means of a traffic model that simulates platoon progression along the links, their combination and possible queuing at nodes. The potential ...

متن کامل

Comparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction

No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...

متن کامل

An Integrated Genetic Algorithm With Dynamic Hill Climbing for VLSI Circuit Partitioning

Genetic Algorithms (GA's) are a class of optimization algorithms that seek improved performance by sampling areas of the solution space that have a high probability for leading to good solutions. In this paper we show the advantage of combining a dynamic hill climbing local search heuristic and the relaxation of size constraint with Genetic Algorithms to solve the circuit partitioning problem. ...

متن کامل

Variational Methods for Stochastic Optimization

In the study of graphical models, methods based on the concept of variational freeenergy bounds have been widely used for approximating functionals of probability distributions. In this paper, we provide a method based on the same principles that can be applied to problems of stochastic optimization. In particular, this method is based upon the same principles as the generalized EM algorithm. W...

متن کامل

Genetic Algorithms: Combining Evolutionary and `Non'-Evolutionary Methods in Tracking Dynamic Global Optima

The ability to track dynamic functional optima is important in many practical tasks. Recent research in this area has concentrated on modifying evolutionary algorithms (EAs) by triggering changes in control parameters, ensuring population diversity, or remembering past solutions. A set of results are presented that favourably compare hill climbing with a genetic algorithm, and reasons for the r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005